Unbounded hardware is equivalent to deterministic turing machines
نویسندگان
چکیده
منابع مشابه
Unbounded Hardware is Equivalent to Deterministic Turing Machines
The purpose of this paper is to investigate models of computation from a realistic viewpoint. We introduce the concept of physical computation as opposed to Junctional computation, and by referring to the laws of physics we study the basic criteria which a model of computation must meet in order to be realistic. With this formal apparatus, we define a very general, realistic model of planar, di...
متن کاملLearning Machines Implemented on Non-Deterministic Hardware
This paper highlights new opportunities for designing large-scale machine learning systems as a consequence of blurring traditional boundaries that have allowed algorithm designers and application-level practitioners to stay – for the most part – oblivious to the details of the underlying hardware-level implementations. The hardware/software co-design methodology advocated here hinges on the de...
متن کاملAcceptance of -Languages by Communicating Deterministic Turing Machines
Using a specific model of communicating deterministic Turing machines we prove that the class of -languages accepted by deterministic Turing machines via complete non-oscillating (complete oscillating) runs on the input coincides with the class of -definable ( -definable, respectively) -languages. email: [email protected] email: [email protected] 2 R. Freund and L. Staiger
متن کاملEncoding Turing Machines into the Deterministic Lambda-Calculus
1. Weakly strategy independent : the image of the encoding is a very small fragment of the λ-calculus, that we call the deterministic λ-calculus Λdet. Essentially, it is the CPS (continuation-passing style) λ-calculus restricted to weak evaluation (i.e., not under abstractions). In Λdet every term has at most one redex, and so all weak strategies collapse into a single deterministic evaluation ...
متن کاملUniversality of quantum Turing machines with deterministic control
A simple notion of quantum Turing machine with deterministic, classical control is proposed and shown to be powerful enough to compute any unitary transformation which is computable by a finitely generated quantum circuit. An efficient universal machine with the s-m-n property is presented. The BQP class is recovered. A robust notion of plain Kolmogorov complexity of quantum states is proposed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90044-0